Updates in answer set programming: An approach based on basic structural properties
نویسندگان
چکیده
We have studied the update operator 1 de ned for update sequences by Eiter et al. without tautologies and we have observed that it satis es an interesting property. This property, which we call Weak Independence of Syntax (WIS), is similar to one of the postulates proposed by Alchourr on, G ardenfors, and Makinson (AGM); only that in this case it applies to nonmonotonic logic. In addition, we consider other ve additional basic properties about update programs and we show that 1 satis es them. This work continues the analysis of the AGM postulates with respect to the 1 operator under a re ned view that considers N2 as a monotonic logic which allows us to expand our understanding of answer sets. Moreover, N2 helped us to derive an alternative de nition of 1 avoiding the use of unnecessary extra atoms.
منابع مشابه
A Roadmap on Updates
Updates, is a central issue in relational databases and knowledge databases. In the last years, it has been well studied in the non-monotonic reasoning paradigm. Several semantics for logic program updates have been proposed (Brewka, Dix, & Knonolige 1997), (De Schreye, Hermenegildo, & Pereira, 1999) (Katsumo & Mendelzon, 1991). However, recently a set of proposals has been characterized to pro...
متن کاملUpdate Operation in ASP Revisited
Revising and updating knowledge bases is an important topic in knowledge representation and reasoning. Various proposals have been made to update logic programs, in particular with respect to Answer Set Programming. Most of these approaches are based on a causal rejection principle, which leads to counterintuitive behaviour. In order to overcome such behaviour, this report presents a collection...
متن کاملUsing Nested Logic Programs for Answer Set Programming
We present a general method to improve computation of answer sets by analyzing structural properties of normal logic programs. Therefore we use labeled directed graphs associated to normal programs, which can be utilized to compute answer sets. The basic idea is to detect special subgraphs of those graphs corresponding to structural properties of normal programs and transform them into simpler ...
متن کاملAn Interactive Approach to Answer Set Programming
This paper outlines a novel approach to the computation of answer sets in an evolving and interactive environment. Instead of recomputing the semantics of the entire program, our approach updates the answer sets after incremental changes to the rule base. This is intended for application domains in which the answer set program is developed or updated during the run time of the system but answer...
متن کاملCoherence of Updates in Answer Set Programming∗
In the context of logic programming under the Answer Set semantics, we propose to introduce a Software Engineering perspective, by discussing the properties that a program should exhibit after an update, i.e., after the addition/deletion of facts and rules during the software development process. In this sense, the property of Strong Equivalence has recently become of interest for its practical...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- TPLP
دوره 7 شماره
صفحات -
تاریخ انتشار 2007